A comparison between two logical formalisms for rewriting
نویسنده
چکیده
Meseguer’s rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed with different objectives. Here we study the relationships between them, both at a syntactic and at a semantic level. Even though it is not possible to establish an entailment system map between them, both can be naturally simulated in each other. Semantically, there is no embedding between the corresponding institutions. Along the way, the notions of entailment and satisfaction in Meseguer’s rewriting logic are generalized.
منابع مشابه
T C C F
We review links between three logic formalisms and three approaches to specifying operational semantics. In particular, we show that specifications written with (small-step and big-step) SOS, abstract machines, and multiset rewriting, are closely related to Horn clauses, binary clauses, and (a subset of) linear logic, respectively. We shall illustrate how binary clauses form a bridge between th...
متن کاملFrom nominal to higher-order rewriting and back again
We present a translation function from nominal rewriting systems (NRSs) to combinatory reduction systems (CRSs), transforming closed nominal rules and ground nominal terms to CRSs rules and terms, respectively, while preserving the rewriting relation. We also provide a reduction-preserving translation in the other direction, from CRSs to NRSs, improving over a previously defined translation. Th...
متن کاملMaude as a Formal Meta-tool
Given the diierent perspectives from which a complex software system has to be analyzed, the multiplicity of formalisms is in some sense unavoidable. This poses two important technical challenges: how to rigorously meet the need to interrelate formalisms, and how to reduce the duplication of eeort in tool and speciication building across formalisms. These challenges could be answered by adequat...
متن کاملA Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis
Formal analysis of security protocols is largely based on a set of assumptions commonly referred to asthe Dolev-Yao model. Two formalisms that state the basic assumptions of this model are related here:strand spaces and multiset rewriting with existential quantification. Strand spaces provide a simple andeconomical approach to analysis of completed protocol runs by emphasizing causa...
متن کاملParsing and Generation as Datalog Queries
We show that the problems of parsing and surface realization for grammar formalisms with “context-free” derivations, coupled with Montague semantics (under a certain restriction) can be reduced in a uniform way to Datalog query evaluation. As well as giving a polynomialtime algorithm for computing all derivation trees (in the form of a shared forest) from an input string or input logical form, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- TPLP
دوره 7 شماره
صفحات -
تاریخ انتشار 2007